A dynamic programming solution to integer linear programs
نویسندگان
چکیده
منابع مشابه
Finite Disjunctive Programming Methods for General mixed Integer linear Programs
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 CHAPTER
متن کاملFinite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs
In this paper, we give a finite disjunctive programming procedure to obtain the convex hull of general mixed-integer linear programs (MILP) with bounded integer variables. We propose a finitely convergent convex hull tree algorithm which constructs a linear program that has the same optimal solution as the associated MILP. In addition, we combine the standard notion of sequential cutting planes...
متن کاملAn Integer Programming Approach for Linear Programs with Probabilistic Constraints
Linear programs with joint probabilistic constraints (PCLP) are known to be highly intractable due to the non-convexity of the feasible region. We consider a special case of PCLP in which only the right-hand side is random and this random vector has a finite distribution. We present a mixed integer programming formulation and study the relaxation corresponding to a single row of the probabilist...
متن کاملSolving multi-stage stochastic mixed integer linear programs by the dual dynamic programming approach?
We consider a model of medium-term commodity contracts management. Randomness takes place only in the prices on which the commodities are exchanged, whilst state variable is multi-dimensional, and decision variable is integer. In [7], we proposed an algorithm based on the quantization of random process and a dual dynamic programming type approach to solve the continuous relaxation problem. In t...
متن کاملLinear Programming and Integer Linear Programming
5 Algorithms 8 5.1 Fourier-Motzkin Elimination . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 5.2 The Simplex Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 5.3 Seidel’s Randomized Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . 9 5.4 The Ellipsoid Method . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 5.5 Using the Ellipsoid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1969
ISSN: 0022-247X
DOI: 10.1016/0022-247x(69)90168-1